Noncoherent uniform algebras in $\mathbb {C}^n$

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

M-IDEAL STRUCTURE IN UNIFORM ALGEBRAS

It is proved that if A is aregular uniform algebra on a compact Hausdorff space X in which every closed ideal is an M-ideal, then A = C(X).

متن کامل

Uniform Algebras on Curves

The proofs use the notion of analytic structure in a maximal ideal space. J. Wermer first obtained results along these lines and further contributions were made by E. Bishop and H. Royden and then by G. Stolzenberg [5] who proved STOLZENBERG'S THEOREM. Let XQC be a polynomially convex set. Let KQC be a finite union of Q-curves. Then (XKJK)*—X\JK is a {possibly empty) pure 1-dimensional analytic...

متن کامل

Polynomial Identification in Uniform and Operator Algebras

Let A be a unital Banach algebra, and denote the spectral radius of f ∈ A by ρ(f). If A is a uniform algebra and ρ(fh + 1) = ρ(gh + 1) for all h ∈ A, then it can be shown that f = g, a result that also carries in algebras of bounded linear operators on Banach spaces. On the other hand ρ(fh) = ρ(gh) does not imply f = g in any unital algebra, marking a distinction between the polynomials p(z, w)...

متن کامل

Surjective Real-Linear Uniform Isometries Between Complex Function Algebras

In this paper, we first give a description of a surjective unit-preserving real-linear uniform isometry $ T : A longrightarrow B$,  where $ A $ and $ B $ are complex function spaces on compact Hausdorff spaces $ X $ and $ Y $, respectively, whenever ${rm ER}left (A, Xright ) = {rm Ch}left (A, Xright )$ and ${rm ER}left (B, Yright ) = {rm Ch}left (B, Yright )$. Next, we give a description of $ T...

متن کامل

A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over $\mathbb{Z}/p\mathbb{Z}$

Proper relation algebras can be constructed using Z/pZ as a base set using a method due to Comer. The cycle structure of such an algebra must, in general, be determined a posteriori, normally with the aid of a computer. In this paper, we give an improved algorithm for checking the cycle structure that reduces the time complexity from O(p) to O(p).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studia Mathematica

سال: 2016

ISSN: 0039-3223,1730-6337

DOI: 10.4064/sm8517-5-2016